ICCV - 99 Cover Sheet

نویسندگان

  • Terence Sim
  • Rahul Sukthankar
  • Matthew D. Mullin
  • Shumeet Baluja
چکیده

We show that a simple, memory-based technique for view-based face recognition, motivated by the real-world task of visitor identification, can outperform more sophisticated algorithms that use Principal Components Analysis (PCA) and neural networks. This technique is closely related to correlation templates; however, we show that the use of novel similarity measures greatly improves performance. We also show that augmenting the memory base with additional, synthetic face images results in further improvements in performance. Results of extensive empirical testing on two standard face recognition datasets are presented, and direct comparisons with published work show that our algorithm achieves comparable (or superior) results. This paper further demonstrates that our algorithm has desirable asymptotic computational and storage behavior, and is ideal for incremental training. Our system is incorporated into an automated visitor identification system that has been operating successfully in an outdoor environment for several months. High-Performance Memory-based Face Recognition for Visitor Identification

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Photo-Consistent 3D Fire by Flame-Sheet Decomposition

This paper considers the problem of reconstructing visually realistic 3D models of fire from a very small set of simultaneous views (even two). By modeling fire as a semi-transparent 3D density field, we show that fire reconstruction is equivalent to a severely under-constrained computerized tomography problem, for which traditional methods break down. Our approach is based on the observation t...

متن کامل

True Single View Point Cone Mirror Omni-Directional Catadioptric System

1 This work has been supported in part by NSF-IIS-0083209, ARO/MURI-DAAH04-96-1-0007, NSF-CDS-97-03220, DARPA-ITO-DABT63-99-1-0017, and Advanced Network and Services. Special thanks to members of MOOSE Project: V. J. Kumar, Kostas Daniilidis, Elli Angelopoulou, Oleg Naroditsky, and Geoffrey Egnal for their invaluable comments and support. Also grateful thanks to members of GRASP Lab for their w...

متن کامل

Camera Calibration and the Search for Infinity

Main difficulty: affine reconstruction, i.e. locating the plane at infinity ( 1 ) in the projective frame (an inherently non-linear problem). Once we have located 1 the remainder of the problem is equivalent to the self-calibration of a rotating camera with varying intrinsics. Recently a couple of methods to achieve this goal have emerged, including a fast linear algorithm (de Agapito et al, CV...

متن کامل

Ambiguity in Reconstruction from Images of Six Points

Let S be a set of six points in space, let be any hyperboloid of one sheet containing S, and let I be a sequence of images of S taken by an uncalibrated camera moving over. Then reconstruction from I is subject to a three way ambiguity which is unbroken as long as the optical centre of the camera remains on. Let p be an image of S taken from a point on. The images`near' p deene a tangent space ...

متن کامل

Multiway Cut for Stereo and Motion with Slanted Surfaces

Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces. In this paper we propose an algorithm to compute correspondence between stereo images or between frames of a motionsequence by minimizingan energy functional that accounts for slanted surfaces. The energy is minimize...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999